Solving semidefinite programming problems via alternating direction methods
نویسندگان
چکیده
منابع مشابه
Alternating direction augmented Lagrangian methods for semidefinite programming
We present an alternating direction method based on an augmented Lagrangian framework for solving semidefinite programming (SDP) problems in standard form. At each iteration, the algorithm, also known as a two-splitting scheme, minimizes the dual augmented Lagrangian function sequentially with respect to the Lagrange multipliers corresponding to the linear constraints, then the dual slack varia...
متن کاملSolving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM). In this paper, we follow the successful approach in [20] and solve the EDMCP by generalizing the completion problem to allow for approximate completions. In particular, we introdu...
متن کاملSolving polynomial least squares problems via semidefinite programming relaxations
A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomial least squares problem to polynomial semidefinite programs to reduce degrees of the polynomials are discussed. Computational efficiency of solving the original polynomial least sq...
متن کاملSolving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be implementable variants of the classical augmented Lagrangian method for optimization problems with separable structures and linear constraints. The proposed framework allows us to solve problems of image restoration, im...
متن کاملSolving Graph Bisection Problems with Semidefinite Programming
An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semideenite programming and polyhedral relax-ations. We report on extensive numerical experiments which were performed for various classes of graphs. The results indicate that the present approach solves general problem instances wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2006
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.07.002